Superfast algorithms for Cauchy-like matrix computations and extensions
نویسندگان
چکیده
منابع مشابه
Fast Cauchy-like and Singular Toeplitz-like Matrix Computations
computes the solution ~ x = T ?1 ~ b to a nonsingular Toeplitz or Toeplitz-like linear system T~ x = ~ b, a short displacement generator for the inverse T ?1 of T, and det T. We extend this algorithm to the similar computations with nn Cauchy (generalized Hilbert) and Cauchy-like matrices. Recursive triangular factorization of such a matrix can be computed by our algorithm at the cost of execut...
متن کاملTR-2014005: Fast Approximation Algorithms for Computations with Cauchy Matrices and Extensions
The papers [MRT05], [CGS07], [XXG12], and [XXCB14] combine the techniques of the Fast Multipole Method of [GR87], [CGR98] with the transformations of matrix structures, traced back to [P90]. The resulting numerically stable algorithms approximate the solutions of Toeplitz, Hankel, Toeplitz-like, and Hankel-like linear systems of equations in nearly linear arithmetic time, versus the classical c...
متن کاملSuperfast Algorithms for Singular Toeplitz-like Matrices
We apply the superfast divide-and-conquer MBA algorithm to possibly singular n × n Toeplitz-like integer input matrices and extend it to computations in the ring of integers modulo a power of a random prime. We choose the power which barely fits the size of a computer word; this saves word operations in the subsequent lifting steps. We extend our early techniques for avoiding degeneration while...
متن کاملA Superfast Algorithm for Confluent Rational Tangential Interpolation Problem via Matrix-vector Multiplication for Confluent Cauchy-like Matrices∗
Various problems in pure and applied mathematics and engineering can be reformulated as linear algebra problems involving dense structured matrices. The structure of these dense matrices is understood in the sense that their n2 entries can be completeley described by a smaller number O(n) of parameters. Manipulating directly on these parameters allows us to design efficient fast algorithms. One...
متن کاملTR-2003004: Superfast Algorithms for Singular Toeplitz/Hankel-like Matrices
Applying the superfast divide-and-conquer MBA algorithm for generally singular n × n Toeplitz-like or Hankel-like integer input matrices, we perform computations in the ring of integers modulo a power of a fixed prime, especially power of 2. This is practically faster than computing modulo a random prime but requires additional care to avoid degeneration, particularly at the stages of compressi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2000
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(00)00041-0